Automatic Programming Using Abstract Data Types

In th i s paper we f i r s t t r y to character ize one meaning of automatic programming. We consider it to be one part of the Programming environment re la ted to A r t i f i c i a l I n te l l i gence techniques. We then i l l u s t r a t e an automatic programning process, on a simple example, using an Abstract Data Type theory to which we add the not ion of schemes which are p a r t i c u l a r l y useful in program de r i va t i on from Abs t rac t Type decomposition. We conclude that a l l the concepts t reated in th i s paper must be con ta i ned in one way or another in any automatic programming system. However th i s necessitates fu r the r study in such t heo re t i ca l f i e l d s as Abstract Data Type Theory, Spec i f i ca t i on languages, Theorem provers or proof cheekers and ru le r e w r i t i n g systems.